YAC : Yet Another Computation Model of Self - Assembly Takashi

This paper proposes a new model for DNA computation called YAC that is based on self-assembly principle. The advantages of the proposed model may be summarized as follows : (i) the model has the universal computability of Turing machines, (ii) nevertheless, it only requires surprisingly simple and basic biomolecular operations, i.e., besides annealing and melting in one-pot reaction, its computation mechanism requires only detect operation for detecting the existence of a completely hybridized double stranded molecule, and therefore (iii) it seems to have high potential of the feasibility in molecular biological implementation. In order to improve time and resource e ciencies of YAC computation, we also argue a pre-computation method and an incremental computation method, respectively.